logoClassRank

Curtin University

Areas of Study

Models of Computation 410

  • 308793
  • Semester 1
  • 25.0
Average Rating
Difficulty Level

The concept of a formal language. The parsing problem. Automata theory and its application. Algorithmic classes and their application. Bounds; the big O notation and space-time bounds. Models of computation; sequential processes, functional processes, object systems, logic systems. Circuit models and cellular structures. -- Course Website

Prerequisites: 308790 (v.1)<br/> Foundations of Computer Engineering 301<br/> <br/> or any previous version



Post an anonymous review of this course

Overall experience
Difficulty Level
POST